Propagating XML constraints to relations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Propagating XML Constraints to Relations

We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given functional dependency is propagated from XML keys via a predefined view; the others compute a minimum cover for all functional dependencies on a universal relation given XML keys. Experimental results show that these algorithm...

متن کامل

Erratum: A Correction to “Propagating XML Constraints to Relations”

This erratum reports a bug in [2], and provides a fix without negative impact on the main results of [2] (the propagation algorithms and their complexity bounds).

متن کامل

Constraints preserving schema mapping from XML to relations

As XML becomes a standard for data representation on the internet, there is a growing interest in storing XML using relational database technology. To date, none of these techniques have considered the semantics of XML as expressed by keys and foreign keys. In this paper, we present a storage mapping which preserves not only the content and structure of XML data, but also its semantics.

متن کامل

Propagating Regular Counting Constraints

Constraints over finite sequences of variables are ubiquitous in sequencing and timetabling. This led to general modelling techniques and generic propagators, often based on deterministic finite automata (DFA) and their extensions. We consider counter-DFAs (cDFA), which provide concise models for regular counting constraints, that is constraints over the number of times a regular-language patte...

متن کامل

Propagating Soft Table Constraints

WCSP is a framework that has attracted a lot of attention during the last decade. In particular, many filtering approaches have been developed on the concept of equivalence-preserving transformations (cost transfer operations), using the definition of soft local consistencies such as, for example, node consistency, arc consistency, full directional arc consistency, and existential directional a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 2007

ISSN: 0022-0000

DOI: 10.1016/j.jcss.2006.10.022